Efficient Authentication of Continuously Moving k NN Queries
نویسندگان
چکیده
A moving kNN query continuously reports the k results (restaurants) nearest to a moving query point (tourist). In addition to the query results, a service provider often returns to mobile client a safe region that bounds the validity of query results in order to minimize the communication cost between the service provider and that mobile client. However, when a service provider is not trustworthy, it may send inaccurate query results or incorrect safe regions to mobile clients. In this paper, we present a framework for authenticating both the query results and the safe regions of moving kNN queries. We theoretically proved that our methods for authenticating moving kNN queries minimize the data sent between the service provider and the mobile clients. Extensive experiments are carried out using both real and synthetic datasets and results show that our methods can perform moving kNN query authentication with small communication costs and overhead.
منابع مشابه
Manycore processing of repeated k-NN queries over massive moving objects observations
The ability to timely process significant amounts of continuously updated spatial data is mandatory for an increasing number of applications. In this paper we focus on a specific data-intensive problem concerning the repeated processing of huge amounts of k nearest neighbours (k-NN) queries over massive sets of moving objects, where the spatial extents of queries and the position of objects are...
متن کاملNearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...
متن کاملNeighbor Queries in Location- Dependent Application
A k nearest neighbor (k-NN) query retrieves k objects in a given objects set which are closest to the query point q. Processing continuous k-nearest neighbor (k-NN) query over moving objects in location-dependent application requires that the frequent location updates of moving objects and intensive continuous k-NN queries must be efficiently processed at the same time. In this paper, we propos...
متن کاملAuthenticating Location Based Services with Spatial Query Processing
Dr.M. CHIDAMBARAM Msc, Mphil, MBA, PhD (Asst.Proff) Rajah Serfoji Government Arts College,Tanjore ---------------------------------------------------------------------***--------------------------------------------------------------------ABSTRACT:A moving kNN query continuously reports the k results (restaurants) nearest to a moving query point (tourist). In addition to the query results, a ser...
متن کاملMoving Convolutions and Continuous Probabilistic Nearest-Neighbor Queries for Uncertain Trajectories
This report presents our solution to the problem of processing continuous Nearest Neighbor (NN) queries for moving objects trajectories when the exact position of a given object at a particular time instant is not known, but is bounded by an uncertainty region. As has already been observed in the literature, the answers to continuous NN-queries in spatiotemporal settings are time parameterized ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Mob. Comput.
دوره 14 شماره
صفحات -
تاریخ انتشار 2015